Dynamic Scheduling Algorithm in Cyber Mimic Defense Architecture of Volunteer Computing

Volunteer computing uses computers volunteered by the general public to do distributed scientific computing. is being used in high-energy physics, molecular biology, medicine, astrophysics, climate study, and other areas. These projects have attained unprecedented power. However, with development of information technology, traditional defense system cannot deal unknown security problems volunteer . At same time, Cyber Mimic Defense (CMD) can defend attack behavior through its three characteristics: dynamic, heterogeneous, redundant. As an important part CMD, dynamic scheduling algorithm realizes change service centralized executor, which enusre reliability CMD Aiming at passive large granularity existing algorithms, this article first proposes a based on time threshold task randomness mimic from two different dimensions; finally, combining random threshold, multi-level queue proposed. The experiment shows that take both into account, has better heterogeneous redundancy characteristics, effectively prevent transformation rule executors mastered attackers.